Metric Dimension Parameterized by Max Leaf Number
نویسندگان
چکیده
منابع مشابه
Metric Dimension Parameterized by Max Leaf Number
The metric dimension of a graph is the size of the smallest set of vertices whose distances distinguish all pairs of vertices in the graph. We show that this graph invariant may be calculated by an algorithm whose running time is linear in the input graph size, added to a function of the largest possible number of leaves in a spanning tree of the graph.
متن کاملOn the Parameterized Max-Leaf Problems: Digraphs and Undirected Graphs∗
The parameterized max-leaf problem on undirected graphs (which is also named the max-leaf spanning-tree problem) is formulated as follows: given an undirected graph G and a parameter k, either construct a spanning tree with at least k leaves for G or report ‘No’ if such a tree does not exist. The problem also has a version for directed graphs that is named the max-leaf out-branching problem. In...
متن کاملOn determining number and metric dimension of graphs
This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian products of graphs and establish some lower bounds on the difference between the two parameters.
متن کاملFractal Dimension as an Assessment Metric for Pseudorandom Number Generators
Editor: Nicholas J. Daras 2nd International Conference on Cryptography, Network Security and Applications in the Armed Forces Hellenic Military Academy
متن کاملOn the Determining Number and the Metric Dimension of Graphs
This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian products of graphs, and establish some lower bounds on the difference between the two parameters. Research supported by projects MEC MTM2008-05866-C03-01 and PAI P06-FQM-01649...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2015
ISSN: 1526-1719
DOI: 10.7155/jgaa.00360